Doubly stochastic matrices with some equal diagonal sums
نویسندگان
چکیده
منابع مشابه
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums
Let s, t,m, n be positive integers such that sm = tn. Let B(m, s;n, t) be the number of m×n matrices over {0, 1} with each row summing to s and each column summing to t. Equivalently, B(m, s;n, t) is the number of semiregular bipartite graphs with m vertices of degree s and n vertices of degree t. Define the density λ = s/n = t/m. The asymptotic value of B(m, s;n, t) has been much studied but t...
متن کاملSubdirect sums of doubly diagonally dominant matrices
The problem of when the k-subdirect sum of a doubly diagonally dominant matrix (DDD matrix) is also a DDD matrix is studied. Some sufficient conditions are given. The same situation is analyzed for diagonally dominant matrices and strictly diagonally dominant matrices. Additionally, some conditions are also derived when card(S)>card(S1) which was not studied by Bru, Pedroche and Szyld [Electron...
متن کاملConditional Autoregressions with Doubly Stochastic Weight Matrices
A conditional spatial autoregression (CAR) specifies dependence via a weight matrix. Employing a doubly stochastic weight matrix allows users to interpret the CAR prediction rule as a semiparametric prediction rule and as BLUP with smoothing in addition to other benefits. We examine standard and doubly stochastic weight matrices in the context of an illustrative data set to demonstrate feasibil...
متن کاملExistence of Matrices with Prescribed Off-Diagonal Block Element Sums
Necessary and sufficient conditions are proven for the existence of a square matrix, over an arbitrary field, such that for every principal submatrix the sum of the elements in the row complement of the submatrix is prescribed. The problem is solved in the cases where the positions of the nonzero elements of A are contained in a given set of positions, and where there is no restriction on the p...
متن کاملDoubly stochastic matrices of trees
In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1978
ISSN: 0024-3795
DOI: 10.1016/0024-3795(78)90079-4